BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
نویسندگان
چکیده
منابع مشابه
Degree Conditions of Fractional ID-k-Factor-Critical Graphs
We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G− I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject C...
متن کاملThe Binding Number of Trees and K(1,3)-free Graphs
The binding number of a graphG is defined to be the minimum of |N(S)|/|S| taken over all nonempty S ⊆ V (G) such that N(S) 6= V (G). In this paper another look is taken at the basic properties of the binding number. Several bounds are established, including ones linking the binding number of a tree to the “distribution” of its end-vertices. Further, it is established that under some simple cond...
متن کامل(Delta-k)-critical graphs
Every graphG of maximum degree is ( +1)-colourable and a classical theorem of Brooks states that G is not -colourable iff G has a ( + 1)-clique or = 2 and G has an odd cycle. Reed extended Brooks’ Theorem by showing that if (G) 1014 then G is not ( − 1)-colourable iff G contains a -clique. We extend Reed’s characterization of ( − 1)-colourable graphs and characterize ( − 2), ( −3), ( −4) and ( ...
متن کاملK-independence Critical Graphs
Let k be a positive integer and G = (V (G), E(G)) a graph. A subset S of V (G) is a k-independent set of G if the subgraph induced by the vertices of S has maximum degree at most k − 1. The maximum cardinality of a k-independent set of G is the k-independence number βk(G). In this paper, we study the properties of graphs for which the k-independence number changes whenever an edge or vertex is ...
متن کاملtotal $k$-distance domination critical graphs
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2008
ISSN: 1015-8634
DOI: 10.4134/bkms.2008.45.1.053